Queueing systems

Queueing Systems

Queueing Systems with

Queueing Systems with Customer Abandonments and Retrials by Song Deng Doctor of Philosophy in Engineering Industrial Engineering & Operations Research University of California, Berkeley Assistant Professor Ying-Ju Chen , Co-chair Professor Zuo-Jun “Max” Shen , Co-chair In queueing theory, the phenomenon that customers get impatient and renege from the system when the waiting time exceeds their ...

Single Queueing Systems

Example 4 Data communication. In computer communication networks standard packages called cells are transmitted over links from one switch to the next. In each switch incoming cells can be buffered when the incoming demand exceeds the link capacity. Once the buffer is full incoming cells will be lost. What is the cell delay at the switches? What is the fraction of cells that will be lost? What ...

Queueing systems on a circle

Consider a ring on which customers arrive according to a Poisson process. Arriving customers drop somewhere on the circle and wait there for a server who travels on the ring. Whenever this server encounters a customer, he stops and serves the customer according to an arbitrary service time distribution. After the service is completed, the server removes the client from the circle and resumes hi...

Queueing Systems with Synergistic Servers

We consider tandem lines with finite buffers and flexible, heterogeneous servers who are synergistic in that they work more effectively in teams than on their own. Our objective is to determine how the servers should be assigned dynamically to tasks in order to maximize the long-run average throughput. In particular, we investigate when it is better to take advantage of synergy among servers, r...